An Automata-Theoretic Approach to Infinite-State Systems
نویسندگان
چکیده
In this paper we develop an automata-theoretic framework for reasoning about infinite-state sequential systems. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Checking that a system satisfies a temporal property can then be done by an alternating two-way tree automaton that navigates through the tree. We show how this framework can be used to solve the model-checking problem for μ-calculus and LTL specifications with respect to pushdown and prefix-recognizable systems. In order to handle model checking of linear-time specifications, we introduce and study path automata on trees. The input to a path automaton is a tree, but the automaton cannot split to copies and it can read only a single path of the tree. As has been the case with finite-state systems, the automata-theoretic framework is quite versatile. We demonstrate it by solving the realizability and synthesis problems for μ-calculus specifications with respect to prefix-recognizable environments, and extending our framework to handle systems with regular labeling regular fairness constraints and μ-calculus with backward modalities.
منابع مشابه
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
We develop an automata-theoretic framework for reasoning about infinitestate sequential systems. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Checking that the system satisfies a temporal propert...
متن کاملAn Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications
We introduce generalized register automata (GRAs) and study their properties and applications in reasoning about systems and specifications over infinite domains. We show that GRAs can capture both VLTL – a logic that extends LTL with variables over infinite domains, and abstract systems – finite state systems whose atomic propositions are parameterized by variable over infinite domains. VLTL a...
متن کاملAn Automata-Theoretic Approach to Modeling Systems and Specifications over Infinite Data
Data-parameterized systems model finite state systems over an infinite data domain. VLTL is an extension of LTL that uses variables in order to specify properties of computations over infinite data, and as such VLTL is suitable for specifying properties of dataparameterized systems. We present Alternating Variable Büchi Word Automata (AVBWs), a new model of automata over infinite alphabets, cap...
متن کاملAutomata Based Interfaces for Control and Scheduling
We propose the use of formal languages of infinite words over the alphabet of task identifiers as an interface between control designs and software implementations. We argue that this approach is more flexible than the classical real-time scheduling framework based on periodic tasks, and allows composition of interfaces by language-theoretic operations. We show that finite automata over infinit...
متن کاملAlternating Automata and Program Verification
We describe an automata-theoretic approach to the automatic verification of finite-state programs. The basic idea underlying this approach is that for any temporal formula we can construct an alternating automaton that accepts precisely the computations that satisfy the formula. For linear temporal logics the automaton runs on infinite words while for branching temporal logics the automaton run...
متن کامل